Classifiers With a Reject Option for Early Time-Series Classification

Early classification of time-series data in a dynamic environment is a challenging problem of great importance in signal processing. This paper proposes a classifier architecture with a reject option capable of online decision making without the need to wait for the entire time series signal to be present. The main idea is to classify an odor/gas signal with an acceptable accuracy as early as possible. Instead of using posterior probability of a classifier, the proposed method uses the "agreement" of an ensemble to decide whether to accept or reject the candidate label. The introduced algorithm is applied to the bio-chemistry problem of odor classification to build a novel Electronic-Nose called Forefront-Nose. Experimental results on wind tunnel test-bed facility confirms the robustness of the forefront-nose compared to the standard classifiers from both earliness and recognition perspectives

A Route Confidence Evaluation Method for Reliable Hierarchical Text Categorization

Hierarchical Text Categorization (HTC) is becoming increasingly important with the rapidly growing amount of text data available in the World Wide Web. Among the different strategies proposed to cope with HTC, the Local Classifier per Node (LCN) approach attains good performance by mirroring the underlying class hierarchy while enforcing a top-down strategy in the testing step. However, the problem of embedding hierarchical information (parent-child relationship) to improve the performance of HTC systems still remains open. A confidence evaluation method for a selected route in the hierarchy is proposed to evaluate the reliability of the final candidate labels in an HTC system. In order to take into account the information embedded in the hierarchy, weight factors are used to take into account the importance of each level. An acceptance/rejection strategy in the top-down decision making process is proposed, which improves the overall categorization accuracy by rejecting a few percentage of samples, i.e., those with low reliability score. Experimental results on the Reuters benchmark dataset (RCV1- v2) confirm the effectiveness of the proposed method, compared to other state-of-the art HTC methods

Learning Sensitive Stigmergic Agents for Solving Complex Problems

Systems composed of several interacting autonomous agents have a huge potential to efficiently address complex real-world problems. Usually agents communicate by directly exchanging information and knowledge about the environment. The aim of the paper is to develop a new computational model that endows agents with a supplementary interaction/search mechanism of stigmergic nature. Multi-agent systems can therefore become powerful techniques for addressing NP-hard combinatorial optimization problems. In the proposed approach, agents are able to indirectly communicate by producing and being influenced by pheromone trails. Each stigmergic agent is characterized by a certain level of sensitivity to the pheromone trails. The non-uniform pheromone sensitivity allows various types of reactions to a changing environment. For efficient search diversification and intensification, agents can learn to modify their sensitivity level according to environment characteristics and previous experience. The resulting system for solving complex problems is called Learning Sensitive Agent System (LSAS). The proposed LSAS model is used for solving several NP-hard problems such as the Asymmetric and Generalized Traveling Salesman Problems. Numerical experiments indicate the robustness and the potential of the new metaheuristic

Sensitive Ants in Solving the Generalized Vehicle Routing Problem

The idea of sensitivity in ant colony systems has been exploited in hybrid ant-based models with promising results for many combinatorial optimization problems. Heterogeneity is induced in the ant population by endowing individual ants with a certain level of sensitivity to the pheromone trail. The variable pheromone sensitivity within the same population of ants can potentially intensify the search while in the same time inducing diversity for the exploration of the environment. The performance of sensitive ant models is investigated for solving the generalized vehicle routing problem. Numerical results and comparisons are discussed and analysed with a focus on emphasizing any particular aspects and potential benefits related to hybrid ant-based models

Key features for the characterization of Android malware families

In recent years, mobile devices such as smartphones, tablets and wearables have become the new paradigm of user–computer interaction. The increasing use and adoption of such devices is also leading to an increased number of potential security risks. The spread of mobile malware, particularly on popular and open platforms such as Android, has become a major concern. This paper focuses on the bad-intentioned Android apps by addressing the problem of selecting the key features of such software that support the characterization of such malware. The accurate detection and characterization of this software is still an open challenge, mainly due to its ever-changing nature and the open distribution channels of Android apps. Maximum relevance minimum redundancy and evolutionary algorithms guided by information correlation measures have been applied for feature selection on the well-known Android Malware Genome (Malgenome) dataset, attaining interesting results on the most informative features for the characterization of representative families of existing Android malware.This research has been partially supported through the project of the Spanish Ministry of Economy and Competitiveness RTC-2014-3059-4. The authors would also like to thank the BIO/BU01/15 and the Spanish Ministry of Science and Innovation PID 560300-2009-11

Heuristic Algorithms for Solving the Generalized Vehicle Routing Problem

The vehicle routing problem (VRP) is one of the most famous combinatorial optimization problems and has been intensively studied due to the many practical applications in the field of distribution, collection, logistics, etc. We study a generalization of the VRP called the generalized vehicle routing problem (GVRP) where given a partition of the nodes of the graph into node sets we want to find the optimal routes from the given depot to the number of predefined clusters which include exactly one node from each cluster. The purpose of this paper is to present heuristic algorithms to solve this problem approximately. We present constructive algorithms and local search algorithms for solving the generalized vehicle routing problem

Urban bicycles renting systems: Modelling and optimization using nature-inspired search methods

Urban Bicycles Renting Systems (UBRS) are becoming a common and useful component in growing modern cities. For an efficient management and support, the UBRS infrastructure requires the optimation of vehicle routes connecting several bicycle base stations and storage centers. In this study, we model this real-world optimization problem as a capacitated Vehicle Routing Problem (VRP) with multiple depots and the simultaneous need for pickup and delivery at each base station location. Based on the VRP model specification, two nature-inspired computational techniques, evolutionary algorithms and ant colony systems, are presented and their performance in tackling the UBRS problem is investigated. In the evolutionary approach, individuals are encoded as permutations of base stations and then translated to a set of routes subject to the constraints related to vehicle capacity and node demands. In the ant-based approach, ants build complete solutions formed of several subtours servicing a subset of base stations using a single vehicle based on both apriori (the attractiveness of a move based on the known distance or other factors) and aposteriori (pheromone levels accumulated on visited edges) knowledge. Both algorithms are engaged for the UBRS problem using real data from the cities of Barcelona and Valencia. Computational experiments for several scenarios support a good performance of both population-based search methods. Comparative results indicate that better solutions are obtained on the average by the ant colony system approach for both considered cities